Complementary beamforming methods and apparatuses

ABSTRACT

Improved methods and apparatuses are provided to address a potential “hidden beam problem” in wireless communication systems employing smart antennas. The improved methods and apparatuses utilize complementary beamforming (CBF) techniques, such as, for example, Subspace Complementary Beamforming (SCBF), Complementary Superposition Beamforming (CSBF) and/or Single Beam Complementary Beamforming (SBCBF) techniques.

RELATED APPLICATIONS

This application is a continuation of and claims priority to U.S. patent application Ser. No. 10/700,991 entitled “Complementary Beamforming Methods and Apparatuses” filed Nov. 3, 2003 to Tarokh et al., the disclosure of which is incorporated by reference herein.

U.S. patent application Ser. No. 10/700,991 claims priority from U.S. Provisional Application Ser. No. 60/423,703 filed Nov. 4, 2002, the disclosure of which is incorporated by reference herein.

TECHNICAL FIELD

This invention relates to wireless communications and more particularly to complementary beamforming methods and apparatuses that can be used in wireless data packet communications systems and other like communication systems.

BACKGROUND

Wireless communication systems continue to change the world that we live in. Wireless telecommunication technology, such as, for example, applied in cellular telephony has created an entirely new mobile communicating society in which people are able to stay in contact regardless of their location, especially in the further case of satellite mobile telephones. Wireless communication systems are also changing the way in which people use their computers and other like devices. Here, for example, wireless local area networks can be configured to allow computer users to become mobile and capable of roaming about coverage area(s) while their computers remain operatively connected to other devices.

In the field of wireless technology there is a continuing desire to increase the effectiveness of the wireless communication system. This desire may lead to lower cost devices, faster communication, increased bandwidth, increases in the size of coverage area(s), etc. One recent improvement to wireless communication systems includes the use of smart antennas. Smart antennas, for example, can be employed in base stations or other like nodes to selectively form directed beams of radiated energy in the direction of another device/node. The smart antennas may also be used to more effectively receive the signals that are transmitted back to it from these and other devices/nodes. These types of smart antenna arrangements within wireless communication systems have proven to be more effective than traditional omni directional antenna arrangements and/or other types of non-smart antenna arrangements in certain environments. U.S. Pat. No. 6,611,231 discloses some exemplary smart antenna systems.

One of the challenges facing wireless communication system designers attempting to use smart antennas is that within an overall supported coverage area there may be multiple devices/nodes supported by a base station and one or more of these devices/nodes may not be able to determine when/if the base station is busy with another device/node due to the selectively reduced coverage area of the transmitted beam(s) from the base station's smart antenna. This type of situation is explained in further examples in the Detailed Description that follows, wherein it is referred to as the “hidden beam problem”.

Consequently, there is a need for methods and apparatuses for addressing the hidden beam problem.

SUMMARY

In order to reduce the “hidden beam problem” in smart antenna applications, complementary beamforming (CBF) techniques may be employed. In accordance with certain exemplary implementations of the present invention, “Subspace Complementary Beamforming” (SCBF), “Complementary Superposition Beamforming” (CSBF) and single beam CBF techniques are provided.

These exemplary techniques help satisfy needs for improved methods and apparatuses for solving hidden beam problems and/or other like problems that can affect wireless communications.

BRIEF DESCRIPTION OF THE DRAWINGS

A more complete understanding of the various methods, apparatuses and systems of the present invention may be had by reference to the following detailed description when taken in conjunction with the accompanying drawings wherein:

FIG. 1 is an illustrative diagram depicting a conventional wireless communication system having a base station with an omni-directional antenna.

FIG. 2 is an illustrative diagram depicting a wireless communication system having an improved base station with a smart directional antenna, in accordance with certain exemplary implementations of the present invention.

FIG. 3 is an illustrative diagram depicting selected features of an improved base station having a smart directional antenna, in accordance with certain exemplary implementations of the present invention.

FIG. 4 is an illustrative diagram depicting a Butler Matrix for use within an improved base station having a smart directional antenna, in accordance with certain exemplary implementations of the present invention.

FIG. 5 is a graph depicting the signal level output (dB) for certain ports of the Butler Matrix of FIG. 4, in accordance with certain exemplary implementations of the present invention.

FIG. 6 is an illustrative diagram depicting a modified Butler Matrix for use within an improved base station having a smart directional antenna, in accordance with certain exemplary implementations of the present invention.

FIG. 7 is a graph depicting the signal level output (dB) for certain ports of the modified Butler Matrix of FIG. 6, in accordance with certain exemplary implementations of the present invention.

FIG. 8 is an illustrative diagram depicting a further modified Butler Matrix for use within an improved base station having a smart directional antenna, in accordance with certain exemplary implementations of the present invention.

FIG. 9 is a graph depicting the signal level output (dB) for certain ports of the further modified Butler Matrix of FIG. 8, in accordance with certain exemplary implementations of the present invention.

FIGS. 10A and 10B are illustrative diagrams depicting an uplink model and a downlink model, respectively, for the improved wireless communication system of FIG. 2, in accordance with certain exemplary implementations of the present invention.

FIG. 11 is an illustrative diagram showing a singular value distribution associated with subspace complementary beamforming, in accordance with certain exemplary implementations of the present invention.

FIGS. 12-15 are illustrative diagrams showing certain features of a downlink beam pattern, in accordance with certain exemplary implementations of the present invention.

FIG. 16 is a graph depicting a beam pattern for certain users after pseudoinverse beamforming, in accordance with certain exemplary implementations of the present invention.

FIG. 17 is a graph depicting a beam pattern of complementary beamforming, in accordance with certain exemplary implementations of the present invention.

FIGS. 18-19 are graphs depicting beam patterns of subspace complementary beamforming, in accordance with certain exemplary implementations of the present invention.

FIG. 20 is a graph depicting a beam pattern for certain users after Hamming windowed MF beamforming without power control, in accordance with certain exemplary implementations of the present invention.

FIG. 21 is a graph depicting a beam pattern of complementary beamforming, in accordance with certain exemplary implementations of the present invention.

FIGS. 22-24 are graphs depicting further beam patterns of subspace complementary beamforming, in accordance with certain exemplary implementations of the present invention.

FIG. 25 is a graph depicting a beam pattern of complementary superposition beamforming, in accordance with certain exemplary implementations of the present invention.

FIGS. 26-30 are graphs depicting further beam patterns of complementary superposition beamforming, in accordance with certain exemplary implementations of the present invention.

FIGS. 31-32 are graphs depicting certain effects of complementary beamforming in accordance with certain exemplary implementations of the present invention.

FIGS. 33-34 are block diagrams depicting certain features of a conventional base station without complementary beamforming capabilities.

FIG. 35 is a block diagram depicting an improved base station that performs subspace complementary beamforming, in accordance with certain exemplary implementations of the present invention.

FIGS. 36 and 37 are block diagrams depicting portions of an improved base station that performs complementary superposition beamforming, in accordance with certain exemplary implementations of the present invention.

DETAILED DESCRIPTION

Overview

This description includes six numbered sections. Section 1 provides an introduction to some exemplary wireless communication systems and the “hidden beam” problem that can significantly reduce the effectiveness of these wireless communication systems. Section 2 describes an exemplary complementary beamforming technique for use with single beam systems. Section 3 describes the hidden beam problem in more detail and introduces further complementary beamforming techniques that may be applied in such wireless communication systems and other like environments. Section 4 introduces a multiple beam uplink and downlink model. Section 5 describes exemplary subspace complementary beamforming techniques that may be applied in wireless communication systems and other like environments having multiple downlink beams to combat hidden beam problems. Section 6 describes some exemplary complementary superposition beamforming techniques that may be applied in such wireless communication systems and other like environments to address the hidden beam problem.

Section 1: Introduction

1.1 Conventional Wireless Communication Systems

FIG. 1 depicts an exemplary conventional wireless communication system 100 having a base station 102 that is configured to transmit and receive signals using an omni-directional antenna (not shown). Base station 102 in this example has a coverage area that extends outward to dashed line 103. Wireless communication system 100 also includes three user stations, shown as, Sta 1, Sta 2, and Sta 3. As illustrated, however, only Sta 1 and Sta 2 are within the coverage area of base station 102. This means that Sta 1 and Sta 2 can each uplink communicate to base station 102 and receive downlink communication from base station 102. Sta 103, being outside of the coverage area cannot receive downlink communications from base station 102.

One popular form of wireless communication system 100 is an IEEE 802.11 based wireless local area network (WLAN), wherein Sta 1 and Sta 2 are applicably configured computers or other like devices. For example, IEEE 802.11a and IEEE 802.11b are currently popular forms of WLANs. The transmit power levels in such wireless communication systems are typically limited by government regulations. As such, Sta 3 can fall outside of the coverage area of the WLAN.

IEEE 802.11 WLANs are based on a Carrier Sense Multiple Access (CSMA) operation in which a each station transmits only when it determines that no other station is currently transmitting. This tends to avoid collisions that occur when two or more stations transmit at the same time. Collisions usually require that the transmitted packets be retransmitted.

1.2 Smart Antenna Wireless Communication Systems

FIG. 2 depicts a wireless communication system 200 having an improved base station 202 that is capable of communicating with all three user stations, namely, Sta 1, Sta 2, and Sta 3. Base station 202, in this example, uses at least one smart antenna (not shown) for at least the downlink transmissions. A smart antenna is one that provides a selectively-directed beamforming capability. For example, a smart antenna may include a phased array antenna or the like.

The smart antenna allows for the (government regulated) limited power of base station 202 to be substantially concentrated in at least one direction or beam. Thus, for example, base station 202 may transmit a beam 203 a to Sta 1, a beam 203 b to Sta 2, and/or a beam 203 c to Sta 3. Even without the additional transmission power, base station 202 has an increased coverage area by focusing the transmit energy to particular direction instead of radiating omni-directionally and is therefore able to service Sta 3. Note that one or more beams 203 a-c may simultaneously be transmitted in certain implementations.

However, if wireless communication system 200 is an IEEE 802.11 based WLAN or some other CSMA or like system, then there is a chance for increased transmission collisions since base station 202 transmits directed beams that may be undetected by one or more of the user stations. Thus, for example, while base station 202 is transmitting downlink beam 203 a to Sta 1, Sta 3 may decide to uplink transmit at the same time since it cannot detect the existing directed beam traffic. This is an example of the hidden beam problem that is addressed herein.

Attention is drawn to FIG. 3, which depicts certain features of exemplary improved base station 202. Here, a transmitter 252 is shown as being operatively coupled to an antenna array 254. In this example, antenna array 254 includes a plurality of elements 258. In certain other implementations, a smart antenna includes a transmitter that is operatively combined with an antenna array. Transmitter 252, in this example, includes a Butler Matrix 256 that is configured to selectively provide energy to one or more elements 258. Transmitter 252 is also operatively coupled to complementary beamforming circuitry 260, which is configured to selectively modify the operation of transmitter 252. An exemplary beam pattern 250 from a smart antenna 254 is also depicted to illustrate that a downlink beam may also have side lobes.

Reference is made to FIG. 33, which is a block diagram illustrating certain features of a conventional beamforming transmitter. Here, a plurality (K) of modulators 300 provide d₁(t), d₂(t), . . . , d_(K)(t) modulated signals to beamforming and vector sum function 304. A downlink beamforming matrix function 302 provides N-by-K matrix W=[w₁, . . . , w_(K)] to beamforming and vector sum function 304. In beamforming and vector sum function 304, x₁, . . . , x_(K) digital signals are generated based on:

$x = {\sum\limits_{k = 1}^{K}{w_{k}{{d_{k}(t)}.}}}$

By way of further example, FIG. 34 depicts further details of an exemplary beamforming and vector sum function 304.

With attention directed back to FIG. 33, digital signals x₁, . . . , x_(K) are then each provided to a corresponding digital-to-analog converter (DAC) 306. The resulting analog signals x₁, . . . , x_(K) are then provided to an RF function 256 and corresponding y₁, . . . , y_(x) RF signals are provided to corresponding elements in array antenna 254.

Section 2: Single Beam Complementary Beamforming (SBCBF)

As described above, increasing the range of 802.11 networks without increased transmit power and using standard clients is possible with smart antennas, such as, for example, directional high-gain antennas. Using directional high gain antennas, it is possible to direct the energy in a given direction and hence increase the range in that direction. However, the media access technique in 802.11 is CSMA which is a listen-before-talk scheme. Forming directional beams has the side effect of hiding the transmitted energy from a large proportion of the clients in the network; i.e., negatively impacting the carrier sense mechanism in the network. An 802.11 user station measures the energy transmitted from access points and other clients. If it cannot detect the presence of other transmissions, it attempts to gain access to the medium. Therefore, when directional antennas are used, many clients detect the medium as idle when in fact it is busy. This hidden beam problem has a severe effect on the performance of the network.

Fortunately, in practice, directional beams are not pencil beams. They generally have a main beam whose width depends on the size of the antenna aperture, and sidelobes which vary in different directions. Nevertheless, these beams tend to have very deep nulls in certain directions. In these directions, the network will suffer from the hidden beam problem the most. Since a given receiver's energy detect threshold is usually lower than it's decoding threshold, it is possible to direct a high power signal towards an intended client and yet ensure a minimum transmit power towards other clients in the network so that the signal may be detected by other clients.

Complementary beamforming, which is introduced in this description, is a novel technique that ensures a minimum transmit power in all directions while preserving the shape of the main beam. The complementary beamforming techniques described in subsequent sections ensure that multiple transmit beams in arbitrary directions are complemented by another beam in all other directions. The complementary beam does not interfere with the intended beams and increases the probability that other users in the network can detect the signal.

In this Section, a complementary beamforming technique is described for use with a single beam communication system. This single beam complementary beamforming (SBCBF) technique is illustrated using an improved base station having a loss-less Butler matrix network as the means of forming the directional beams with phased array antennas. It should be understood, however, that the SBCBF technique can be applied to other types of beamforming networks.

FIG. 4 depicts Butler Matrix 250 and a linear array antenna 254 with N elements connected thereto. Butler Matrix 250 includes N input ports (x₀, x₁, x₂, . . . , x_(N−1)) and N output ports (y₀, y₁, y₂, . . . , y_(N−1)).

For a single-beam operation, the transmit signal is fed into one of the input ports of the Butler matrix. The result is a directional beam from the antenna in a given direction. For instance, if the transmit signal is fed into input port 0, the beam is directed at boresight. The beam pattern depends on the number of antenna elements and the antenna element spacing.

A graph 500 in FIG. 5 shows the output beams 502 and 504 due to transmit signals at input port x₀ and input port x₃, respectively, of Butler Matrix 250 for a linear array of 16 elements with half-wavelength spacing. As shown, beams 502 and 504 have very deep nulls in certain directions and the highest sidelobe levels are around 14 dB down from the main lobe's peak.

SBCBF reduces the effect of the nulls and increases the sidelobe levels without a severe power penalty to the main beam. SBCBF techniques may be implemented in a variety of ways. In this Seefion, two different exemplary implementations are illustrated, namely a post-combining SBCBF implementation and a pre-combining SBCBF implementation.

An exemplary post-combining SBCBF implementation is depicted in FIG. 6. Here, a gain mechanism 602 is configured to modify the signal at output port y₀. A complementary beam is then formed due to the increase in gain.

Mathematically, this may be described as:

$y_{i} = \left\{ {{\begin{matrix} {\gamma\; y_{i}} & {i = 0} \\ {y_{i}} & {otherwise} \end{matrix}\gamma} \geq {1\mspace{31mu} 0} \leq i \leq {N - 1}} \right.$

To ensure the same output power as with no complimentary beamforming the output voltage on all the ports should be adjusted by a scaling factor:

$G_{s} = \sqrt{\frac{N}{\gamma^{2} + N - 1}}$

The power penalty for the main beam will be:

${\Delta\; P} = \frac{\left( {\gamma + N - 1} \right)^{2}}{N\left( {\gamma^{2} + N - 1} \right)}$

or in dB:

${\Delta\; P_{d\; B}} = {10\;\log\;\left( \frac{\left( {\gamma + N - 1} \right)^{2}}{N\left( {\gamma^{2} + N - 1} \right)} \right)}$

For example, for a 16 element array, if γ=3.5, then the power loss is about 1 dB.

Graph 700 in FIG. 7 depicts the shape of a transmit beam 702 without SBCBF applied and a transmit beam 704 with SBCBF applied. Here, the transmit beam is due to a signal at port x₀ of Butler Matrix 250. As shown, the output with complementary beamforming (transmit beam 704) has higher sidelobes in all directions and removes all the deep nulls except for the nulls on the main beam. In this example, the main beam's peak power is about 1 dB lower than that without complementary beamforming.

2.1 Exemplary Pre-Combining SBCBF Implementation

With an exemplary pre-combining approach, the complementary beam is formed by feeding the transmit signal to the appropriate input port of the Butler matrix and at the same time feeding a fraction (Σ) of the transmit signal to the other input ports.

FIG. 8 depicts an exemplary pre-combining SBCBF arrangement for use in base station 202. Here, the transmitter output 800 if combined with a gain 802 in combiner 804. The output of combiner 804 is applied along with transmitter output in a 2-to-N splitter 806, which then provides signals to Butler Matrix 250.

Mathematically, the signals at the input ports of Butler Matrix due to intended transmission through the ith port may be described as:

$x_{j} = \left\{ {{\begin{matrix} {x_{i}} & {j = i} \\ {ɛ\; x_{i}} & {otherwise} \end{matrix}ɛ} < {1\mspace{31mu} 0} \leq j \leq {N - 1}} \right.$

In other words, splitter 806 directs the transmitted signal to the appropriate input port x_(i) and an attenuated version of the same signal to the other N−1 input ports of Butler Matrix 250. To ensure the same output power as with no complimentary beamforming the input voltage on all the ports should be adjusted by a scaling factor:

$G_{s} = \frac{1}{\sqrt{1 + {\left( {N - 1} \right)ɛ^{2}}}}$

Here, the power penalty for the main beam is: ΔP=1+(N−1)ε²

or in dB: ΔP _(dB)=10 log(1+(N−1)ε²)

By way of example, for a 16 element array, if Σ=0.135, the power loss is about 1 dB.

Graph 900 in FIG. 9 depicts the shape of a transmit beam 902 without SBCBF applied and a transmit beam 904 with SBCBF applied to a signal at port x₀ of Butler matrix 250. As shown transmit beam 904 with complementary beamforming has higher sidelobes in all directions and removes all the deep nulls except for the nulls on the main beam. Here, the main beam's peak power is about 1 dB lower than that without complementary beamforming.

Section 3: Complementary Beamforming (CBF)

In this Section, some further exemplary complementary beamforming techniques are described.

As mentioned above, complementary beamforming can substantially reduce or even eliminate the potential for hidden beam problems. One exemplary application of complementary beamforming is in smart antennas enhancements to IEEE 802.11 wireless communication systems that may suffer from the hidden beam problem. Here, for example, some user stations may be nulled out by the beamformer and in a busy period wrongly determine that the channel is idle. This can cause these users to transmit packets in a busy period and cause packet collisions. For the case that the downlink channel is busy, the complementary beamforming (CBF) techniques provided herein are designed to significantly reduce the probability of the aforementioned packet collisions.

In this Section, exemplary CBF techniques are described for both the intended and silent users and prove that, when compared to conventional methods, for a negligible incurred power loss for the intended users, the effects of the hidden beam problem caused by the unintended users in the system can be significantly reduced. Additionally, in this Section, a second application of complementary beamforming to smart antenna enhancement of wireless cellular systems will be discussed. Those skilled in the art will recognize, therefore, that the methods and apparatuses of the present invention are adaptable to other types of wireless communication systems.

3.1 The Hidden Beam Problem

To further illustrate the situation, consider a scenario when a wireless communication system has a base station with m transmit antennas and the base station transmitter simultaneously transmits to k user stations (users). Without loss of generality, it is assumed in this example that k≦m.

A conventional beamformer seeks to increase the power pointed to the k desired users. Consider a scenario where there are m=2 transmit antennas and k=1 intended users. Let the channel matrix to the desired user be given by (α, β). A conventional beamformer then induces weights:

$w_{1} = {{\frac{\;\overset{\_}{\alpha}}{\sqrt{{\alpha }^{2} + {\beta }^{2}}}\mspace{14mu}{and}\mspace{14mu} w_{2}} = \frac{\;\overset{\_}{\beta}}{\sqrt{{\alpha }^{2} + {\beta }^{2}}}}$ at the transmitter, where α and β are the conjugates of α and β respectively. If c₁ is the intended transmit signal at time 1 for user 1, then w₁c₁ and w₂c₁ are transmitted signals from antennas 1 and 2 respectively. The intended user receives the signal: r ₁ =αw ₁ c ₁ +βw ₂ c ₁ +n ₁=√{square root over (|α|²+|β|²)}c ₁ +n ₁

where n₁ is the noise.

It can then be observed that the signal to noise power ratio of the desired user improves by a factor of 10 log, (|α|²+∥β∥²) dB.

The above improvement for the above transmission scenario does not come for free, however. Let an unintended user have channel matrix ((− β, α)). Then the signal at this unintended user is given by y=− βw ₁ c ₁ + αw ₂ c ₁ +n ₁ =n ₁  (2)

where n₁ is the noise and the unintended user receives no signal.

As such, there is no version of the transmitted signal at this unintended user. This by itself may not seem to pose a serious problem, since after all the transmission was not intended for this user station. But it turns out that this can cause a problem in beamforming enhancements to the IEEE 802.11 WLAN standard based systems. In systems designed based on this standard, all user stations and the base station (e.g., access point) share the same channel for both uplink and downlink transmissions. Each user senses the channel and only transmits packets if it determines that the channel is not busy. In the aforementioned scenario, the unintended user may determine that the channel is idle and transmit uplink packets. These transmissions in turn may cause packet collisions that can reduce the throughput of the system. This then is the hidden beam problem.

3.2 Complementary Beamforming

One important aspect of complementary beamforming is that much less power is needed for an unintended user station to correctly detect a busy period than is required for correct detection of a transmitted packet. This makes it possible to provide improved beamforming schemes that, when compared to conventional beamforming schemes, incur a meager loss to the power pointed to the intended user station(s), while significantly improving the probability of correct detection of busy periods for unintended user stations.

3.3 Exemplary Solution to the Hidden Beam Problem

In wireless communications, it is well understood that detecting channel activity is much simpler than decoding the received word. For example, an error in detection of channel activity may occur when a transmitted codeword is confused with an all zero signal. In contrast, a decoding error may occur when a transmitted signal is confused with other code words.

One may arrive at the above conclusion using tools of information theory. At code rates above the channel capacity, for example, Shannon has proved that the block decoding error probability asymptotically tends to one and that the bit error rate is bounded below by a positive number. However, even at transmission rates above capacity, it is easy to observe that the probability of channel activity detection error asymptotically goes to zero as the block length goes to infinity.

The above is considered in designing the detection criteria for channel activity in IEEE 802.11 WLAN standards. Each device listens to the channel in some time window and compares the energy collected in this window to a threshold called the CCD. Activity is detected only if the collected energy is greater than the CCD value. It has been found that IEEE 802.11 devices generally tend to require much less receive power to correctly determine channel activity than to decode the transmitted signals.

This motivates solutions to the hidden beam problem in that a beam pattern may be constructed which directs most of the transmitted power to the intended recipients while directing a small fraction of the total power to unintended users. With such a beam pattern the unintended users will all sense the transmission to the desired users with high probability and will likely remain silent during a busy downlink period. This in turn reduces the packet collision probability.

To construct such a beam pattern in this Section the following notation is employed:

-   -   δ_(j) denotes a k-dimensional column vector with j-th component         equal to 1 and other components equal to zero.     -   For any vector X, X^(T) and X^(H) respectively denote the         transpose and Hermitian of X.     -   For any matrix D, W_(D) denotes the vector space spanned by the         columns of D.     -   The channel from transmit antenna l to the intended user j is         given by α_(l,j).     -   A_(j) denotes the column vector (α_(1,j), α_(2,j), . . .         α_(m,j))^(T). Vector A_(j) may be referred to as the spatial         signature of user j.     -   A denotes the matrix whose j-th column is A_(j).     -   R^(t)=(r₁ ^(t), r₂ ^(t), . . . , r_(k) ^(t)) and X^(t)=(x₁ ^(t),         x₂ ^(t), . . . , x_(m) ^(t)) respectively denote the received         signals at intended users j=1, 2, . . . , k at time t and         signals transmitted from antennas 1, 2, . . . , m.     -   C^(t)=(c₁ ^(t), c₂ ^(t), . . . , c_(k) ^(t)), where c_(j) ^(t)         is the signal intended to the j=1, 2, . . . , k desired user at         time t.     -   For any matrix A, Tr(A) denotes the trace (sum of diagonal         elements of A).     -   N^(t)=(n₁ ^(t), n₂ ^(t), . . . , n_(m) ^(t)) is the noise vector         components at time t at the intended users; thus, it is         well-known that:         R _(t) =X ^(t) A+N ^(t)  (3)

In most cases, these components are assumed to be Gaussian with σ² variance per complex dimension. No assumptions are made on the statistics of the matrix A. It will be assumed that c^(t) _(j), j=1, 2, . . . , k, t=1, 2, . . . , L are elements of a signal constellation with average signal E_([c) ^(t) _(j)].

It is also assumed that the elements of the signal constellation are normalized so that their average power is E[|c^(t) _(j)]²=1. In general X^(t)=C^(t)B where B is referred to as the beamforming matrix.

The choice of B depends on the beamforming strategy and many approaches for the selection of B are suggested in existing literature. By way of example, assuming that the matrix A is known at the transmitter and the existence of (A^(H)A)⁻¹, for a zero-forcing beamformer

$\begin{matrix} {{B = \frac{\left( {A^{H}A} \right)^{- 1}A^{H}}{\sqrt{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}}}{and}{X^{t} = \frac{{C^{t}\left( {A^{H}A} \right)}^{- 1}A^{H}}{\sqrt{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}}}} & (4) \end{matrix}$

For a maximum SINR beamformer,

$\begin{matrix} {{B = \frac{\left( {{A^{H}A} + {\frac{1}{SNR}I}} \right)^{- 1}A^{H}}{\sqrt{{Tr}\left( {\left( {{A^{H}A} + {\frac{1}{SNR}I}} \right)^{- 2}A^{H}A} \right)}}}{where}{{SNR} = {\frac{1}{\sigma^{2}}.}}} & (5) \end{matrix}$

Under the above assumptions the total transmit power is easily computed to be 1. Note that a zero-forcing beamformer may not be appropriate in some applications as it may enhance the noise. Thus, a maximum SINR beamformer may be more appropriate in some applications.

For simplicity, however; a technique for the zero-forcing beamformer will be illustrated in this Section. Nonetheless, it is noted that the method presented here generalizes to the maximum SINR case as well. This generalization is described in part.

Here, it is assumed that the spatial signature matrix A is constant during the transmission of a packet and varies from one packet to another.

Thus, for a zero-forcing beamformer, the received signal at the receiver is given by:

${R^{t} = {\frac{C^{t}}{\sqrt{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}} + N^{t}}},$

and it is observed that each intended user j=1, 2, . . . , k receives a noisy version of its intended signal scaled by a factor Tr((A^(H)A)⁻¹).

If an unintended user has spatial signature B=(b₁, b₂, . . . , b_(m))^(T) orthogonal to all the rows of A, then the user receives the signal: y ^(t) =X ^(t) B+η ^(t) =C ^(t)(A ^(H) A)⁻¹ A ^(H) B/√{square root over (Tr((A ^(H) A))}+η^(t)=η^(t),

at time t, where η^(t) is Gaussian noise. This means that such a user does not receive any signal at all. The same is true for maximum SINR beamforming. As mentioned above, such an unintended user can confuse a busy downlink period with a silent period and transmit packets during a busy period. This can cause unwanted collisions and reduce the efficiency of the system.

Whenever a k×m beamforming matrix is fixed during transmission of a packet, then, any unintended user that has spatial signature in the orthogonal complement of the subspace generated by the rows of the beamforming matrix receives no signal at all. This conclusion is also true for the case of maximum SINR beamforming. This motivates the use of different beamforming matrices at different instances of time during the transmission of downlink packets, so that the effects of the hidden beam problem can be reduced.

3.3.1 An Exemplary Proposed Scheme:

It is observed that the subspace W_(A) is a k-dimensional subspace of the complex m-dimensional complex space and has an orthogonal complement W_(A) ^(⊥) of dimension m−k. Let U₀, U₁, U_(m−k−1), form an orthonormal basis for W_(A) ^(⊥). In other words, U₀, U₁, . . . , U_(m−k−1) are mutually orthogonal m-dimensional column vectors of length one in W_(A) ^(⊥). Clearly, U_(j) ^(H)A_(i)=0 for 0≦j≦m−k−1 and 1≦i≦k.

With this in mind, as part of the scheme the base station transmitter constructs matrices Z₁, Z₁, . . . , Z_(L), where L is the length of downlink transmission period, such that these matrices satisfy the following four properties (A-D).

-   -   A: For all 1≦i≦L, the matrix Z_(i) is a k×m matrix whose rows         are in the set {0, ±U₀ ^(H), ±U₁ ^(H), . . . , ±U_(m−k−1) ^(H)}     -   B: If L is even, then, Z₂=−Z₁, Z₄=−Z₃, . . . , Z_(L)=Z_(L−1)     -   C: If L is odd, then Z₂=−Z₁, Z₄=−Z₃, . . . , Z_(L−1)=−Z_(L−2),         Z_(L)=0, and     -   D: Each element +U₀ ^(H), −U₀ ^(H), +U₁ ^(H), −U₁ ^(H), . . . ,         +U_(m−k−1) ^(H), −U_(m−k−1) ^(H) appear p times in the list of         Lk rows of Z₁, Z₁, . . . , Z_(L) for some positive integer p. If         this cannot be exactly satisfied, the scheme can include having         the number of these appearances sufficiently close to each         other.         From Property D, it is observed that:         k(L−1)≦2p(m−k)≦Lk  (6)

Because p≧1, from the above inequality, for

${L < \frac{2\left( {m - k} \right)}{k}},$ Property D cannot always be exactly satisfied. Thus, one cannot always provide a perfectly balanced appearance of +U₀ ^(H), −U₀ ^(H), +U₁ ^(H), −U₁ ^(H), . . . , +U_(m−k−1) ^(H), −U_(m−k−1) ^(H) for extremely short packets.

There are a number of ways to construct matrices of Z₁, Z₁, . . . , Z_(L) that satisfy Property D approximately or exactly when possible. In one simple approach, let the rows of Z_(2i-1) be respectively U_(0⊕i) ^(H), U_(1⊕i) ^(H), . . . , U_(k−1⊕i) ^(H) where i⊕j denote (i+j) mod (m−k) for i=1, 2, 3, . . . , [L/2] and let Z_(2i)=−Z_(2i-1). This gives the matrices Z₁, Z₁, . . . , Z_(L) whenever L is even. Note that Z_(L) is given by Property C whenever L is odd.

It can be seen that the matrices Z₁, Z₁, . . . , Z_(L) given by the above construction substantially satisfy the above Properties. Other constructions are also possible.

Once Z₁, Z₁, . . . , Z_(L) are constructed, at each time t, the transmitter chooses the beamforming matrix:

$\begin{matrix} {S^{t} = \left\lbrack {{\left( {A^{H}A} \right)^{- 1}{A^{H}/\sqrt{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}}} + {\frac{1}{\sqrt{k}}{ɛZ}_{i}}} \right\rbrack} & (7) \end{matrix}$

where ε≧0 is a fixed positive number. The choice of ε governs the trade-off between the power pointed to the intended users and that pointed to unintended users. By increasing the power pointed to intended users, the intended users enjoy better channels, while by pointing more power to unintended users, better channel activity detection during the busy periods can be achieved. This trade-off will be analyzed in the next subsection and criteria for the choice of ε determined.

Note that the same method applies to the case of maximum SINR beamforming. Also, in this exemplary scheme the beamforming matrix varies from one time to another. This causes a small fraction of power to be pointed in every direction of the coverage space such that unintended receivers can determine channel activity periods with higher probabilities.

3.4 Analysis of Complementary Beamforming

We analyze the exemplary complementary beamforming scheme of as proposed above both for the intended and unintended receivers.

3.4.1 The Power Penalty for The Intended Users:

The addition of the term

$\frac{1}{\sqrt{k}}{ɛZ}_{i}$ to the matrix (A^(H)A)⁻¹A^(H) √{square root over (Tr((A^(H)A)⁻¹))} increases the transmit power. To compute the penalty, the orthogonality of U₁, U₁, . . . , U_(L) and the columns of A can be used to conclude that Z_(t)A=0 for all t=1, 2, . . . , L. Thus, one can compute the receive word for intended users to be:

${R^{t} = {{{C^{t}S^{t}A} + N^{t}} = {\frac{C^{t}}{\sqrt{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}} + N^{t}}}},$

which is the same as the conventional beamforming. In contrast, in the case of the exemplary complementary beamforming scheme, the matrix equality Tr[(Y+W)(Y+w)^(H) ]+Tr[(Y−W)(Y−W)^(H)]=2Tr(YY ^(H))+2Tr(WW ^(H))

and Properties B and D used to compute the average transmitted power

$\frac{\sum\limits_{t = 1}^{L}{{Tr}\left( {S_{t}S_{t}^{H}} \right)}}{L} = {1 + {\frac{\sum\limits_{t = 1}^{L}{{Tr}\left( {Z_{t}Z_{t}^{H}} \right)}}{Lk}{{ɛ}^{2}.}}}$

From Property D, we have

${\sum\limits_{t = 1}^{L}{{Tr}\left( {Z_{t}Z_{t}^{H}} \right)}} = {2{p\left( {m - k} \right)}}$ thus $\frac{\sum\limits_{t = 1}^{L}{{Tr}\left( {S_{t}S_{t}^{H}} \right)}}{L} = {1 + {\frac{2{p\left( {m - k} \right)}}{Lk}{{ɛ}^{2}.}}}$

One may now prove the following Theorem.

Theorem 1 The intended users in complementary beamforming when compared to the conventional method suffer a loss of at most 10 log, (1|ε|²).

Proof. This follows from the above and from Inequality (6).

3.4.2 Analysis of the Power delivered to Silent Users:

Let B=(b₁, b₂, . . . , b_(t))^(T) denote the channel of an arbitrary unintended user. One may then study the power received by this unintended user under complementary beamforming. To this end, it is recognized that the columns of matrix A and the vectors U₁, U₁, . . . , U_(m−k) span the complex m-dimensional space. Thus, B=e ₁ A ₁ + . . . +e _(k) A _(k) +d ₁ U ₁ + . . . +d _(m−k) U _(m−k)  (8)

for some constants e₁, e₂, . . . , e_(k) and d₁, d₂, . . . , d_(m−k). Computing B^(H)B, provides

$\begin{matrix} {{\sum\limits_{j = 1}^{m}{b_{i}}^{2}} = {{\left( {e_{1}^{H},e_{2}^{H},\ldots\mspace{11mu},e_{k}^{H}} \right)A^{H}{A\left( {e_{1}^{H},e_{2}^{H},\ldots\mspace{11mu},e_{k}^{H}} \right)}^{H}} + {\sum\limits_{j = 1}^{m - k}{d_{j}}^{2}}}} & (9) \end{matrix}$

At time t, the unintended receiver now receives y ^(t) =X ^(t) B+η ^(t) =C ^(t) S ^(t) B+η ^(t′)

By replacing for S^(t) and B from Equations (7) and (8) and observing that (A^(H)A)⁻¹A^(H)A_(j)=δ_(j), A^(H)U_(i)=0, and Z_(i)A_(i)=0, one arrives at the conclusion that

$\begin{matrix} {{S^{t}B} = {\frac{\left( {e_{1}^{H},e_{2}^{H},\ldots\mspace{11mu},e_{k}^{H}} \right)^{H}}{\sqrt{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}} + {\frac{ɛ}{\sqrt{k}}{\sum\limits_{j = 1}^{m - k}{d_{j}Z_{t}U_{j}}}}}} & (10) \end{matrix}$

Next the average expected receive signal power is computed as

$\begin{matrix} {P_{av} = {\frac{\sum\limits_{t = 1}^{L}{E\left\lbrack {y^{t}}^{2} \right\rbrack}}{L} = \frac{\sum\limits_{t = 1}^{L}{{Tr}\left( {S^{t}{{BB}^{H}\left( S^{t} \right)}^{H}} \right)}}{L}}} & (11) \end{matrix}$

However, since Z_(2i)=−Z_(2l-1) for

${l = 1},2,\ldots\mspace{11mu},\left\lbrack \frac{L}{2} \right\rbrack$ is assumed, one can use Equation (10) and with manipulations arrive at

${{Tr}\left( {{S^{2l}{{BB}^{H}\left( S^{2l} \right)}^{H}} + {S^{{2l} - 1}{{BB}^{H}\left( S^{{2l} - 1} \right)}^{H}}} \right)} = {\frac{2{\sum\limits_{j = 1}^{m}{e_{i}}^{2}}}{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)} + {\frac{{ɛ}^{2}}{k}{\sum\limits_{j = 1}^{m - k}{{{d_{j}}^{2}\left\lbrack {{{Tr}\left( {Z_{{2l} - 1}U_{j}U_{j}^{k}Z_{{2l} - 1}^{H}} \right)} + {{Tr}\left( {Z_{2l}U_{j}U_{j}^{k}Z_{2l}^{H}} \right)}} \right\rbrack}.}}}}$

Using the above and after manipulation

$P_{av} = {\frac{\sum\limits_{j = 1}^{m}{e_{i}}^{2}}{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)} + {\frac{{ɛ}^{2}}{kL}{\sum\limits_{j = 1}^{m - k}{{d_{j}}^{2}{\sum\limits_{t = 1}^{L}{{{Tr}\left( {Z_{t}U_{j}U_{j}^{H}Z_{2l}^{H}} \right)}.}}}}}}$

The sum

$\sum\limits_{t = 1}^{L}{{Tr}\left( {Z_{t}U_{j}U_{j}^{H}Z_{2l}^{H}} \right)}$ is exactly equal to the number of times that ±U_(j) appears in the list of the rows of Z₁, Z₁, . . . , Z_(L). By Property D this amounts to 2p. Thus,

$\begin{matrix} {P_{av} = {\frac{\sum\limits_{j = 1}^{n}{e_{i}}^{2}}{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)} + {{ɛ}^{2}\frac{2p}{kL}{\sum\limits_{j = 1}^{m - k}{d_{j}}^{2}}}}} & (12) \end{matrix}$

One can now proceed to lower bound P_(av). To this end, the following theorem can be proven.

Theorem 2. Let λ_(min)(A^(H)A) and λ_(max)(A^(H)A) respectively denote the minimum and maximum eigenvalues of A^(H)A. Then provided that:

$\begin{matrix} {{ɛ}^{2} \leq {\frac{\left( {m - k} \right)}{k}\frac{\lambda_{\min}\left( {A^{H}A} \right)}{\lambda_{\max}\left( {A^{H}A} \right)}}} & (13) \end{matrix}$

complementary beamforming guarantees a fraction

${ɛ}^{2}\frac{\sum\limits_{j = 1}^{m}{b_{j}}^{2}}{m}$ of the transmitted power to an unintended receiver whose spatial signature is B=(b₁, b₂, . . . , b_(m))

Proof: Let an unintended user with spatial signature given by B=(b₁, b₂, . . . , b_(m)) be given. Suppose that the Inequality (13) holds. From Equations (8) and (12), it is observed that:

$P_{av} = {{{ɛ}^{2}\frac{2p}{kL}{\sum\limits_{i - 1}^{m}{b_{i}}^{2}}} - {\left( {e_{1}^{H},e_{2}^{H},\ldots\mspace{11mu},e_{k}^{H}} \right){G\left( {e_{1}^{H},e_{2}^{H},\ldots\mspace{11mu},e_{k}^{H}} \right)}^{H}}}$

where

$G = \left\lbrack {{{ɛ}^{2}\frac{2p}{kL}A^{H}A} - \frac{I}{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}} \right\rbrack$ and I is the identity matrix. The matrix G is Hermitian, thus it can be concluded that:

$\begin{matrix} {P_{av} \geq {{{ɛ}^{2}\frac{2p}{kL}{\sum\limits_{i = 1}^{m}{b_{i}}^{2}}} - {{\lambda_{\max}(G)}{\sum\limits_{j = 1}^{k}{e_{k}}^{2}}}}} & (14) \end{matrix}$

where λ_(max)(G) is the maximum eigenvalue of G

Hence,

${\lambda_{\max}(G)} = {{{ɛ}^{2}\frac{2p}{kL}{\lambda_{\max}\left( {A^{H}A} \right)}} - \frac{1}{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}}$

Next, it can be shown that λ_(max)(G)≦0.

Here,

${{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)} \leq \frac{k}{\lambda_{\min}\left( {A^{H}A} \right)}$ thus using Condition (13)

$\frac{1}{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)} \geq \frac{\lambda_{\min}\left( {A^{H}A} \right)}{k} \geq \frac{{ɛ}^{2}{\lambda_{\max}\left( {A^{H}A} \right)}}{m - k}$

which gives:

${{ɛ}^{2}\frac{2p}{kL}{\lambda_{\max}\left( {A^{H}A} \right)}} \leq {\frac{2{p\left( {m - k} \right)}}{kL}\frac{1}{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}} \leq {\frac{1}{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}.}$

using Inequality (6). It can be concluded from the above that λ_(max)(G)≦0.

Using Equation (14), this implies that:

$\begin{matrix} {P_{av} = {{{ɛ}^{2}\frac{2p}{kL}{\sum\limits_{i = 1}^{m}{b_{i}}^{2}}} \geq {{ɛ}^{2}\frac{2{pm}}{kL}\frac{\sum\limits_{i = 1}^{m}{b_{i}}^{2}}{m}}}} & (15) \end{matrix}$

Using the Inequality (6), it is determined that

$P_{av} \geq {{ɛ}^{2}{\frac{\sum\limits_{i = 1}^{m}{b_{i}}^{2}}{m}.}}$

It may not seem natural to the reader that the Condition (13) on ε contains terms of the form λ_(min)(A^(H)A)/λ max(A^(H)A). This condition should not seem surprising, however, since in the case that the ratio λ_(min)(A^(H)A)/λ max(A^(H)A) is small, the matrix A^(H)A is close to being singular. This means that even the intended users, do not receive significant signal powers. Practical beamforming schemes, when scheduling transmission to intended users always assure that the ratio A_(min)(A^(H)A)/λ max(A^(H)A) is sufficiently large. In fact a ratio

${{\lambda_{\min}\left( {A^{H}A} \right)}/{{\lambda max}\left( {A^{H}A} \right)}} \geq \frac{1}{3}$ is generally an acceptable assumption. In the case of certain exemplary implementations, k=4, m=16xi. Thus, provided that the exemplary system's scheduling algorithm can guarantee that

${{\lambda_{\min}\left( {A^{H}A} \right)}/{{\lambda max}\left( {A^{H}A} \right)}} \geq \frac{1}{30}$ the above complementary beamforming scheme could be used to provide any fraction |ε|²≦0.1 of the transmitted power to unintended users.

For example, consider the case when there are m=2 and k=1 receive antennas. Assuming that the channel to the intended user is given by A=(α,β)^(T) it is observed that λ_(min)(A^(H)A)/λ max(A^(H)A)=1 and as long as |ε|²≦1, by the above theorem a fraction |ε|² of the transmitted power is pointed to unintended users at the expense of a loss of at most 10 log₁₀(1+[ε]²) to the intended user. With ε=0.1, a power of 20 dB below transmit power can be guaranteed to any unintended users so that they can detect channel activity, while the power penalty for the intended user is only 0.044 dB.

The beamforming matrices S₁, and S₂ in this case are given by:

$S_{2} = {\frac{1}{\sqrt{{\alpha }^{2} + {\beta^{2}}}}\left( {{\overset{\_}{\alpha} + {ɛ\beta}},{\overset{\_}{\beta} - {ɛ\alpha}}} \right)}$

with S_(2l-1)=S, and S_(2l)=S₂ for l=1, 2, . . . ,

${l - 1},2,\ldots,\left\lbrack \frac{L}{2} \right\rbrack$ when the transmission period is of length L with

$S_{L} = {\frac{1}{\sqrt{{\alpha }^{2} + {\beta^{2}}}}\left( {\overset{\_}{\alpha},\overset{\_}{\beta}} \right)}$ when L is odd.

Considering yet another example, let k=4 and m=16. Then the channel matrix A is a 16×4 matrix. The columns of this matrix are 16-dimensional vectors A₁, A₂, A₃, and A₄. Here, two cases may be recognized:

Conventional Beamforming:

In order to do conventional beamforming the beamforming matrix

$B = \frac{\left( {A^{H}A} \right)^{- 1}A^{H}}{\sqrt{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}}$ needs to be computed. This matrix is then used for transmission.

Complementary Beamforming: In addition to the above computation, one also needs to compute an orthonormal basis of 16 dimensional vectors U₀, U₁, U₂, . . . , U₁₁ for the orthogonal complement of the subspace spanned by the columns of A. This can be done, for example, using the Gram-Schmidt method and requires roughly the same number of operations as the computation of B.

The matrices Z₀, Z₁, . . . , Z_(L) are constructed as below. When L is odd, let Z_(L)=0. For any L (either even or odd), let Z_(2i)=−Z_(2i-1) for

${i = 1},2,\ldots\mspace{11mu},{\left\lfloor \frac{L}{2} \right\rfloor.}$ The matrix Z₁, Z₃, and Z₅ can be defined to have respectively rows equal to U₀ ^(H), U₁ ^(H), U₂ ^(H), U₃ ^(H), U₄ ^(H), U₅ ^(H), U₆ ^(H), U₇ ^(H), U₈ ^(H), U₉ ^(H), U₁₀ ^(H), and U₁₁ ^(H).

One may then periodically define

Z₁=Z₇=Z₁₃= . . . ,

Z₃=Z₉=Z₁₅= . . . ,

Z₅=Z₁₁=Z₁₇= . . .

and let

$S^{t} = \left\lbrack {{\left( {A^{H}A} \right)^{- 1}{A^{H}/\sqrt{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}}} + {\frac{1}{\sqrt{k}}ɛ\; Z_{t}}} \right\rbrack$

be the complementary beamforming matrix at time t.

It can be observed from the above that complementary beamforming is approximately twice as much computationally intensive as conventional beamforming in this example.

The above exemplary schemes and others presented herein may be applied to other wireless communication systems. For example, a cellular network application can use this type of beamforming enhancement for TDMA systems. In these systems, beamforming can be used to increase SINR of some intended users, while a small amount of power can be pointed to all other users so that the control information also called USF (uplink state flag) which requires much lower data rates can be transmitted to all the users in the system.

The complementary beamforming technique presented above guarantees that in any flat fading and non-fading environment including even richly scattered environments, the power received by a user under complementary beamforming is at least a fraction of the power received by a user under omni transmission. For this reason the beamforming matrix varies from time to time. For this reason complementary beamforming may not be as easy to implement in analog environments.

Supposing, however, that this requirement is relaxed and to only require that in a non-scatterer free space environment, the power received by a user under complementary beamforming is at least a fraction of the power received by a user under omni-directional transmission. Then there are other ad hoc complementary beamforming solutions using fixed matrices. One such a solution may be to define matrices P₀, P₁, . . . , P_(m−k) to be matrices whose rows are respectively U₀ ^(H), U₁ ^(H), . . . , U_(m−k) ^(H) and let the fixed beamforming matrix be given by

$\begin{matrix} {S = \left\lbrack {{\left( {A^{H}A} \right)^{- 1}{A^{H}/\sqrt{{Tr}\left( \left( {A^{H}A} \right)^{- 1} \right)}}} + {\frac{1}{\sqrt{k}}ɛ\;{\sum\limits_{i = 1}^{m - k}P_{i}}}} \right\rbrack} & (16) \end{matrix}$

Such a solution can be shown using simulations to be a complementary beamforming solution in a non-scattering free space environment. This solution is much more appealing for analog implementation.

Section 4: Multiple Beam Downlink Model

In this Section some exemplary uplink and downlink models are described.

Attention is drawn to FIGS. 10(A) and 10(B). FIG. 10(A) depicts an uplink model and FIG. 10(B) depicts a downlink model between a linear array antenna 254 having N elements and user stations Sta 1 and Sta 2.

In FIG. 10(A), it is assumed that the k-th user's signal arriving at an angle θ_(k) has a complex channel gain h_(k)=|h_(k)|e^(jφ) ^(k) . As such, the received signal y(t) can be modeled as follows: y(t)=[h ₁ a(θ₁)h ₂ a(θ₂) . . . h _(K) a(θ_(K))]d(t)+n(t)

where a(θ) represents a steering vector or spatial signature, d(t)=[d₁(t) d₂(t) . . . d_(K)(t)]^(T) is a uplink signal vector of K stations and n(t) is a AWGN vector. In the uniform linear array (ULA) 254 with N elements spaced a distance d, the steering vector becomes

${a(\theta)} = \left\lbrack {1{\mathbb{e}}^{j\frac{2\;\pi}{\lambda}d\;\cos\;\theta}\mspace{11mu}\ldots\mspace{11mu}{\mathbb{e}}^{j\frac{2\;\pi}{\lambda}{({N - 1})}d\;\cos\;\theta}} \right\rbrack^{T}$ where λ is wavelength. With knowledge of direction-of-arrivals (DOAs) and |h_(k)| one can apply MMSE beamforming which provides the best SINR among linear equalizers.

In FIG. 10(B), since the channel gain can be assumed to be the same as that of the uplink in TDD mode, the received signal r_(k)(t) at station k can be written as:

${r_{k}(t)} = {{{h_{k}{a^{T}\left( \theta_{k} \right)}{x(t)}} + {n_{k}(t)}} = {{h_{k}{\sum\limits_{k = 1}^{K}{{a^{T}\left( \theta_{k} \right)}w_{k}{d_{k}(t)}}}} + {n_{k}(t)}}}$

where

${x(t)} = {\sum\limits_{k = 1}^{K}{w_{k}{d_{k}(t)}}}$ is the transmitted vector and w_(k) represents the transmit weight vector for user k. In a vector form r(t)=[h ₁ a(θ₁)h ₂ a(θ₂) . . . h _(K) a(θ_(K))]^(T) Wd(t)+n(t)

where r(t)=[r_(j)(t) r₂(t) . . . r_(K)(t)]^(T), and W=[w₁ w₂ w_(K)] is the weight matrix.

One can then define steering matrix A=[a(θ₁) a(θ₂) . . . a(θ_(K))], channel magnitude matrix h=diag(|h₁| |h₂| . . . |h_(K)|), and channel phase matrix Φ=diag(e^(jφ) ¹ e^(jφ) ² . . . e^(jφ) ^(K) ).

As such, the received downlink vector can be written as: r(t)=ΦHWd(t)+n(t)

where H=hA^(T).

In scattering channel, the received downlink vector can be written as r(t)=HWd(t)+n(t)

where channel matrix H is composed of complex numbers.

With perfect knowledge of H, one has several downlink beamforming matrices:

(1) Pseudoinverse: W=H⁺=H=H^(H)(HH^(H))⁻¹=A*(A^(T)A*)⁻¹h⁻¹

(2) Matched Filter (MF): W=A*, A*h, A*h⁻¹

(3) Windowed MF: W=diag(b₀, b₁, . . . , b_(N−1))A*, where b_(k) is a windowing coefficient.

The following assumptions may be made:

(a) rank(A)=K.

(b) Non-zero channel gain (|h_(k)|≠0). Thus, h is non-singular.

(c) Non-zero windowing coefficient (|b_(k)|0). Thus, rank(diag(b₀, b₁, . . . , b_(N−1))A*)=K.

Reference is now made to FIGS. 12-15, which help to further illustrate the downlink channel in a multiple beam system and an exemplary graphical depiction of a complementary beam forming process (described in greater detail in the next Section).

FIG. 12 shows an ideal complementary beamforming example, wherein line 1202 illustrates the transmit beams to Sta 1 and Sta 2, and area 1204 illustrates the coverage area of the complementary beam, in which Sta 3 is included. As such, Sta 3 will be able to determine that the downlink channel is busy. The complementary beam may, for example, carry the same data as the beams to STA 1 or 2 or both, independent data, Preamble, CTS, or other like data.

FIGS. 13-15 graphically show how a complementary beam in this example may be formed. In FIG. 13, the first step is develop an omnipattern, such as {tilde over (z)}(θ)=z(θ)+z^(c)(θ)=∥a^(T)(θ)W∥²+∥a^(T)(θ)W^(c)∥²=C₀. Next, as shown in FIG. 14, nulls are developed at the DOAs for Sta 1 and Sta 2. For example, {tilde over (z)}(θ)=z(θ)+z^(c)(θ)=∥a^(T)(θ)W∥²+∥a^(T)(θ)W^(c)∥². Then, as illustrated in FIG. 15, the complementary beam power is scaled appropriately. For example, {tilde over (z)}(θ)=z(θ)+k₀z^(c)(θ)=∥a^(T)(θ)W∥²+k₀∥a^(T)(θ)W^(c)∥².

Section 5: Subspace Complementary Beamforming (SCBF)

In this Section, “Subspace Complementary Beamforming” (SCBF) is described. Here, by using dummy independent data streams additional energy is radiated in the directions of side lobe so that user stations in the hidden beam can detect the channel activity. As with earlier exemplary schemes, the SCBF technique does not significantly interfere with intended user stations.

The downlink beam pattern of user k is defined as follows: z _(k)(θ)=|a ^(T)(θ)w _(k)|², 0≦θ≦π

By assuming each client's data is independent, the total beam pattern of K downlink signals can be written as:

${z(\theta)} = {{\sum\limits_{k = 1}^{K}{{{a^{T}(\theta)}w_{k}}}^{2}} = {{{a^{T}(\theta)}W}}^{2}}$

where W=[w₁ w₂ . . . w_(K)] represents the weight matrix. The total beam will have K main beams. The complementary beam can be generated by either modifying the weight matrix or expanding the weight matrix to larger matrix. In this Section we will take the latter approach. In general designing arbitrary shape of the beam is difficult problem, e.g., as illustrated in FIGS. 12-15. It might be impossible because of the limited degree of freedom.

Before describing the exemplary SCBF or SCBF II implementations in greater mathematical detail, reference is first made to FIG. 35, which is a block diagram illustrating certain features of an SCBF or SCBF II beamforming transmitter. Here, a plurality (K) of modulators 300 provide d₁(t), d₂(t), . . . , d_(K)(t) modulated signals to a beamforming and vector sum function 305. Also, a plurality (L) of modulators 301 provide {tilde over (d)}₁(t), {tilde over (d)}₂(t), . . . , {tilde over (d)}_(L)(t) modulated dummy signals to beamforming and vector sum function 305. A downlink beamforming matrix function 302 provides vectors W=[w₁, . . . , w_(k)] to beamforming and vector sum function 305. Also, a complementary beamforming matrix function 303 provides vectors W^(c)=[w₁ ^(c), . . . , w_(K) ^(c)] to beamforming and vector sum function 305. In beamforming and vector sum function 305, x₁, . . . , x_(K) digital signals are generated based on:

$x = {{\sum\limits_{k = 1}^{K}{w_{k}{d_{k}(t)}}} + {\sum\limits_{l = 1}^{L}{w_{l}^{c}{{{\overset{\sim}{d}}_{l}(t)}.}}}}$

Digital signals x₁, . . . , x_(K) are then each provided to a corresponding digital-to-analog converter (DAC) 306. The resulting analog signals x₁, . . . , x_(K) are then provided to an RF function 256 and corresponding y₁, . . . , y_(K) RF signals are provided to corresponding elements in array antenna 254.

Certain exemplary design approaches include a three step design. First generate omni-directional beam using additional independent data streams. Second, in order to avoid any interference create nulls at intended user's DOAs. Third, control the complementary beam power.

5.1 Generate Omnipattern

The objective is to generate the complementary beam which makes the total beam pattern to be omni-directional. Define the complementary beam pattern z^(c)(θ) as:

${z^{c}(\theta)} = {{\sum\limits_{k = 1}^{L}{{{a^{T}(\theta)}w_{k}^{c}}}^{2}} = {{{a^{T}(\theta)}W^{c}}}^{2}}$

where W^(c)=└w₁ ^(c) w₂ ^(c) . . . w_(L) ^(c)┘ is a weight matrix for the generation of the complementary beam. The complementary weight matrix W^(c) should be chosen in the way that the radiated power is constant over entire angles. That is {tilde over (z)}(θ)≡z(θ)+z ^(c)(θ)=∥a ^(T)(θ)W∥ ² +|a ^(T)(θ)W ^(c)∥²=const., 0≦θ<π  (17)

Note the complementary beam introduces additional interference with the amount of ∥a^(T)(θ)W^(c)∥² to the user located at angle θ even with orthogonality between w_(k) and w₁ ^(c) for any k and l.

Defining {tilde over (W)}=[W W^(c)], the {tilde over (z)}(θ) can be rewritten as: {tilde over (z)}(θ)=∥a ^(T)(θ){tilde over (W)}∥ ² =a ^(T)(θ)Da*(θ)=C ₀, 0≦θ≦π

where D={tilde over (W)}{tilde over (W)}^(H)=WW^(H)+W^(c)W^(c) ^(H) and C₀ is the constant power level.

Note for the omni-directional beam pattern the matrix D={tilde over (W)}{tilde over (W)}^(H) should be a diagonal matrix with power constraint Tr{{tilde over (W)}{tilde over (W)}^(H)}=C₀. It is of interest whether there exists a complementary weight matrix W^(c) and if exists whether it is unique. If C₀ is greater than a certain threshold which depends on the peak value of the beam, there will be a solution. If there exists a solution, there will be multiple solutions since the constraint (17) considers only the signal power.

Giving a singular value decomposition to W W=UΛV^(H),

where

$\Lambda = \begin{bmatrix} \lambda_{1} & 0 & \cdots & 0 \\ 0 & \lambda_{2} & \ddots & \vdots \\ \vdots & \cdots & \ddots & 0 \\ 0 & \cdots & 0 & \lambda_{K} \\ 0 & \cdots & \cdots & 0 \\ \vdots & \; & \; & \vdots \\ 0 & \cdots & \cdots & 0 \end{bmatrix}$ is the singular matrix, U and V are unitary matrices, one can rewrite D as D=UΛΛ ^(H) U ^(H) +W ^(c) W ^(cH′)

One needs to find a matrix W^(c) which makes the matrix D to be a diagonal matrix with Tr{D}=C₀. If it is assumed that matrix W^(c)W^(c) ^(H) has the following special structure W^(c)W^(cH)=UΛ^(c)Λ^(cH)U^(H′)

then D becomes D=U(ΛΛ^(H)+Λ^(c)Λ^(cH))U ^(H′)

In this particular case, if and only if the matrix ΛΛ^(H)+Λ^(c)Λ^(c) ^(H) is an identity matrix with a scalar c₀, D becomes a diagonal matrix i.e. D=c₀I. With a power constraint set by C₀ one can find the singular values λ_(k) ^(c)'s of Λ^(c) which satisfy following equations: |λ_(k)∥²+∥λ_(k) ^(c)∥² =c ₀, 1≦k≦N and Nc₀=C₀

where λ_(k)=0 is assumed for K<k≦N.

Clearly, c₀ should be greater than or equal to max(|λ_(k)|²). FIG. 11 depicts a singular value distribution example.

The complementary weight matrix W^(c) is as follows W^(c)=UΛ^(c)V^(cH)

where V^(c) ^(H) is any unitary matrix. Obviously, there are multiple solutions even in this special case. For simplicity, assume an identity matrix for the unitary matrix. Then, W^(c)=UΛ^(c)  (18)

which generates the complementary beam pattern for the omni-directional beam.

5.2 Generate Nulls

To generate nulls at each user's DOA, the following condition should be satisfied a ^(T)(θ_(k))w ₁ ^(c)=0, 1≦k≦K and 1≦l≦L.

The inner product

a*(θ_(k)),w₁ ^(c)

should be zero for all k and l. Then, one achieves z^(c)(θ_(k))=0 for all k.

Denote S the subspace spanned by vectors a*(θ_(k)) and S^(⊥) the orthogonal complement subspace of S. Now decompose w₁ ^(c) into two orthogonal components, one lies in S^(⊥) and the other lies in S^(⊥) as follows: w ₁ ^(c) =P _(S) w ₁ ^(c) +P _(S) _(⊥) w ₁ ^(c),

where P_(S) and P_(S) _(⊥) are projection matrices to S and S^(⊥), respectively and defined by P _(S) =A*(A ^(T) A*)⁻¹ A ^(T) and P _(S) _(⊥) =I−P _(S).

In the scattering channel, the projection matrices are defined by P _(S) =H*(H ^(T) H*)⁻¹ H ^(T) and P _(S) _(⊥) =I−P _(S).

Clearly, P_(S) _(⊥) w₁ ^(c) will not generate any power to the intended users.

Then, the complementary weight matrix can be obtained by applying the orthogonal projection to (18) W ^(c)=(I−P _(S))UΛ ^(c).

Giving SVD to A*=Ũ{tilde over (Λ)}{tilde over (V)}^(H) (in scattering channel H*=Ū{tilde over (Λ)}{tilde over (V)}^(H)), the complementary weight matrix becomes:

$W^{c} = {\left( {\sum\limits_{l = {K + 1}}^{N}{{\overset{\sim}{u}}_{l}{\overset{\sim}{u}}_{l}^{H}}} \right)U\;\Lambda^{c}}$

where ũ_(l) is the l-th column vector of Ũ.

Certainly, the projection technique can be applied to the downlink beamforming to generate nulls at other user's DOAs.

Theorem 3: rank(W^(c))=N−K or N−K−1 and, if the downlink beamforming matrix has a special form W=A*B where B is a non-singular K-by-K matrix, the complementary weight matrix degenerates to W^(c)=√{square root over (c₀)}[u_(K+1) u_(K+2) . . . u_(N)] where W=UΛV^(H) is assumed.

Proof: Obviously, the rank of P_(S) _(⊥) is N−K. The rank of UΛ^(c) is N or N−1 depending on the value of c₀. Using following property: rank(A)+rank(B)−N≦rank(AB)≦min(rank(A),rank(B))

where N is number of columns of A or number of rows of B, since K≧1 the rank of W^(c)=P_(S) _(⊥) UΛ^(c) is N−K or N−K−1.

Define S′ as the subspace spanned by columns of W. Since W=A*B and B is a non-singular matrix, the matrices W and A* are column-equivalent. Hence, the space S and S′ are identical. See, e.g., Dennis B. Ames, Fundamentals of Linear Algebra, International Textbook Company, 1970.

Note the projection matrix P_(S′) is equal to P_(S) because: P _(S′) =A*B(B ^(H) A ^(T) A*B)⁻⁻¹ B ^(H) A ^(T) =A*(A ^(T) A*)⁻¹ A ^(T) =P _(S).

The projection matrices for S′ and S′^(⊥) are

$\begin{matrix} {P_{S^{\prime}} = {{W\left( {W^{H}W} \right)}^{- 1}W^{H}}} \\ {= {{U\begin{bmatrix} I_{K \times K} & 0_{K \times {({N - K})}} \\ 0_{{({N - K})} \times K} & 0_{{({N - K})} \times {({N - K})}} \end{bmatrix}}U^{H}}} \end{matrix}$ and ${{I - P_{S^{\prime}}} = {{\sum\limits_{l = {K + 1}}^{N}{u_{l}u_{l}^{H}}} = {{U\begin{bmatrix} 0_{K \times K} & 0_{K \times {({N - K})}} \\ 0_{{({N - K})} \times K} & I_{{({N - K})} \times {({N - K})}} \end{bmatrix}}U^{H}}}},$ respectively.

The complementary weight matrix can be written as:

$W^{c} = {{\left( {I - P_{S}} \right)U\;\Lambda^{c}} = {{\left( {I - P_{S^{\prime}}} \right)U\;\Lambda^{c}} = {\sqrt{c_{0}}{{U\begin{bmatrix} 0_{K \times K} & 0_{K \times {({N - K})}} \\ 0_{{({N - K})} \times K} & I_{{({N - K})} \times {({N - K})}} \end{bmatrix}}.}}}}$

Since the first K columns of W^(c) are zero vectors, the complementary weight matrix can degenerate to: W ^(c)=√{square root over (c ₀)}[u _(K+1) u _(K+2) . . . u _(N)].

Since the pseudoinverse or MF beamforming matrix satisfy the above condition, the complementary weight matrix can be obtained through SVD to W. On the other hand the windowed MF does not satisfy the above condition and since W^(c) is an N-by-N matrix, though its rank is N−K at most, one needs to create N independent data streams. However, using SVD to W^(c)

${W^{c} = {{\left( {\sum\limits_{l = {K + 1}}^{N}{{\overset{\sim}{u}}_{l}{\overset{\sim}{u}}_{l}^{H}}} \right)U\;\Lambda^{c}} = {\overset{\_}{U}\mspace{11mu}\overset{\_}{\Lambda}\;{\overset{\_}{V}}^{H}}}},$

and the fact that the rank of W^(c) is N−K if rank(A^(c))=N, the complementary weight matrix degenerates to: W ^(c)=[ λ ₁ ū ₁ λ ₂ ū ₂ . . . λ _(N−K) ū _(N−K)].

Note the column vectors in W^(c) have different weights. This makes the overall beam pattern to be omni-directional. Since one can scale the complementary beam power level, the overall beam power at the directions of the side lobe cannot be flat. Instead of trying to make the overall beam to be flat, a flat complementary beam is enough. Changing W^(c) to: W ^(c)=√{square root over (c ₀)}[ū ₁ ū ₂ . . . ū _(N−K)]  (19)

will not generate severe ripple as far as the ripple of W is small because the beam pattern of W^(c) (19) will have constant level at the hidden beam angles.

5.3 Scale

Since the total beam does not have to be omni-directional for the hidden beam problem, the power level of the complementary beam should be lowered by adjusting k₀. For example,

Non-windowed downlink beam: W^(c)=√{square root over (k₀c₀)}[u_(K+1) u_(K+2) . . . U_(N)]

Windowed downlink beam: W^(c)=√{square root over (k₀c₀)}[ū₁ ū₂ . . . ū_(N−K)].

The side lobe power of the complementary beam is 10 log₁₀ C₀+10 log₁₀ k₀ where C₀=Nc₀ is the level of the main lobe.

5.4 Exemplary Subspace Complementary Beamforming II (SCBF II) Technique.

Now assume 2K<N and introduce augmented matrix W_(a) W _(a) =[WA*].

In the scattering channel we define the augmented matrix as W _(a) =└WH*┘.

The rank r of W_(a) is in the range of K to 2K. The vectors orthogonal to W_(a) can generate another complementary beam. Through SVD, one can have SCBF II as follows: W _(a) ^(c)=√{square root over (c ₀)}[u _(a,r+1) u _(a,r+2) . . . u _(a,n)]

where u_(a,l) is the l-th left singular vector whose corresponding singular value is zero. In the windowed downlink beamforming the rank of W^(c) is N−2K. This means the number of additional independent data streams required is smaller than that of SCBF and smaller transmitted power is required for the same level of complementary beam. However, because of less degree of freedom for the creation of the complementary beam, more ripple in the complementary beam is observed.

Theorem 4: If the downlink beamforming matrix has a special form W=A*B where B is a non-singular K-by-K matrix, the SCBF II and SCBF yield identical beam patterns.

Proof; The augmented matrix W_(a) can be written as W _(a) =[A*BA*]=A*[BI]=U _(a)Λ_(a) V _(a) ^(H).

Note the rank r of W_(a) is K. The complementary weight matrix of the SCBF II is given by: W _(a) ^(c)=√{square root over (c ₀)}[u _(a,K+1) u _(a,K+2) . . . u _(a,N)].

Apparently, W_(a) ^(c) ^(H) W_(a)=0. This leads to W_(a) ^(c)W=0.

Remember that the columns of W^(c) of the SCBF are also orthogonal to columns of W, W^(c) ^(H) W=0.

It can be observed that the matrices W_(a) ^(c) and W^(c) have the same column spaces with bases u_(a,K+1), . . . , u_(a,N) and u_(K+1), . . . , u_(N) respectively. Hence, the matrices W_(a) ^(c) and W^(c) are column-equivalent. Thus, there exists a non-singular square matrix Q satisfying following identity W^(c)=W_(a) ^(c)Q.

Since u_(a,k) and u_(k) are orthonormal bases, the matrix Q should be unitary.

The beam pattern generated by W^(c) can be written as: z ^(c)(θ)=∥a ^(T)(θ)W ^(c)∥² =∥a ^(T)(θ)W _(a) ^(c) Q∥ ² =a ^(T)(θ)W _(a) ^(c) QQ ^(H) W _(a) ^(cH) a*(θ)=∥a ^(T)(θ)W _(a) ^(c)∥².

Thus, ∥a ^(T)(θ)W ^(c)∥² =a ^(T)(θ)W _(a) ^(c)∥².

5.5 Null widening Technique

Until now the ideal DOA estimation has been assumed. In reality, however, since there will likely be a DOA estimation error, this causes a severe SIR penalty. In order to reduce the sensitivity to the DOA estimation error one can generate one or more additional nulls at vicinity of DOA's. This can be obtained by changing the steering matrix A. For example, the steering vector α(θ_(k))may be replaced with: {tilde over (a)}(θ_(k))=[a(θ_(k)−Δθ_(l))a(θ_(k))a(θ_(k)+Δθ_(r))].

The new steering matrix for the projection becomes: Ã=[ã(θ₁)ã(θ₂) . . . ã(θ_(K))].

The projection using the above steering matrix will generate nulls at not only θ_(k) but also θ_(k)−Δθ_(l) and θ_(k)+Δθ_(r). The optimum number and positions of additional nulls will depend on the N, K, DOA estimation error and antenna array structure (i.e. steering vector). The null widening technique creates wider nulls if θ_(k)−Δθ_(l) and θ_(k)+Δθ_(r) are chosen properly. Unfortunately, however, one may not be able to generate as many nulls as are needed. If the rank of Ã is equal to N, the projection matrix becomes P_(S)=I.

Thus, P_(S) _(⊥) =0.

This means that one cannot generate any complementary beam when the rank of Ã is equal to N. Thus, there is a limitation on the number of additional nulls. The total number of nulls should be less than N. Note that in certain implementations, the null widening technique is applied to the downlink beamforming also to reduce side lobe level or create wider nulls at other intended user's DOAs.

This exemplary null widening technique is useful in non-zero angular and delay spread channels when the downlink beamforming matrix is calculated assuming free space channel. The complementary beam or side lobe of intended user's main beam may cause interference to other intended user's main beam in multipath channels though they have deep nulls. Thus, wider nulls are more desirable in multipath channels in order to reduce the chance of the interference to all intended users. Furthermore, the complementary beam level may be controlled adaptively based on the channel environments.

5.6 Simulations

Here, pseudoinverse downlink beamforming is considered with four active users and N=16 in the ULA 254 with d=λ/2. The channel condition is summarized in Table 1, below. The downlink beam patterns of users are shown in graph 1600 in FIG. 16.

TABLE 1 Channel condition Relative Power DOA(deg) 20log|h_(k)| User1 40  0 dB User2 90 −20 dB User3 100 −30 dB User4 140 −50 dB

In FIG. 16, graph 1600 depicts the beam patterns for each of the user's beams, where user 1 is represented by line 1602, user 2 is represented by line 1604, user 3 is represented by line 1606, and user 4 is represented by line 1608. Graph 1700 in FIG. 17 depicts the sum of each user's beam (line 1702), complementary beam z^(c)(θ) (line 1704), and z(θ)+z^(c)(θ) (line 1706). The complementary beam makes the resulting output to be omni-directional. However, since the complementary beam does not generate nulls at each user's DOA, each client will experience low SIR. By generating nulls at the intended user's DOA, the complementary beam does not interfere with any other beams.

As shown in graph 1800 of FIG. 18, the complementary beam (line 1804) has nulls at each user's DOA. Also shown are the sum of each beam (line 1802) and z(θ)+z^(c)(θ) (line 1806). Additionally, in graph 1900 of FIG. 19, by setting k₀ to 0.01, the power of the complementary beam (line 1904) is reduced by 20 dB. One can expect the SIR to remain at infinity due to the generation of nulls. Also shown are the sum of each beam (line 1902) and z(θ)+z^(c)(θ) (line 1906).

Next, consider the Hamming windowed MF beamforming without power control. The beam patterns of each user are shown in graph 2000 of FIG. 20, where user 1 is represented by line 2002, user 2 is represented by line 2004, user 3 is represented by line 2006, and user 4 is represented by line 2008. In graph 2100 of FIG. 21, the complementary beam (line 2104) is depicted. Note the sum z(θ)=z(θ)+z^(c)(θ) (line 2106) is greater than the maximum of z(θ) (line 2102). This means that the complementary beam will introduce non-zero interference power to users.

For the omni-directional radiated power the c₀ should be greater than or equal to max(|λ_(k)|²). Then, the radiated power has the relation C ₀ =Nc ₀ ≧Nmax(|λ_(k)|²).

If C₀>z(θ), then the complementary beam's interference to users at θ is C₀−z(θ). However, the complementary beam (2204) does not generate any interference to the directions of intended user's DOAs as depicted through the projection shown in graph 2200 of FIG. 22. Also shown here are the sum of each beam (line 2202) and z(θ)+z^(c)(θ) (line 2206).

In graph 2300 of FIG. 23 the beam of the SCBF II (line 2304) is illustrated when it is applied to the windowed MF downlink beam. One can notice there is a ripple at the complementary beam itself. Under the same transmitted power condition the complementary beam exhibits higher level. Also shown here are the sum of each beam (line 2302) and z(θ)+z^(c)(θ) (line 2306).

Graph 2400 in FIG. 24 shows the effect of an exemplary null widening technique. Depicted are the complementary beam (line 2404) the sum of each beam (line 2402) and z(θ)+z^(c)(θ) (line 2406). The additional nulls are set to θ_(k)−Δθ_(l)=θ_(k)−0.5°, and θ_(k)+Δθ_(r)=θ_(k)+0.5°. As such, for example, one can achieve 29 dB suppression at θ_(k)±5°.

Section 6: Complementary Superposition Beamforming (CSBF)

In this Section “Complementary Superposition Beamforming” (CSBF) techniques are described. In CSBF the side lobe level of any one of main beams is increased in order for the hidden beam clients not only to detect some power but, in some cases, to decode the data packet as well.

In the subspace complementary beamforming one needs to generate N−K dummy random data streams. The SIR of each dummy data is too low to decode because N independent data streams are transmitted at hidden beam angles. Through the SCBF the hidden beam clients can decide the channel is busy by detecting some energy but cannot decode the data. If the hidden beam clients can decode and extract important information such as CTS and preamble, etc., the hidden beam problem would be more controllable.

6.1 Complementary Superposition Beamforming (CSBF)

Instead of sending additional random data, CSBF increases the side lobe power of one of main beams which has the highest side lobe level so that the hidden beam users are able to not only detect some energy but also decode the data packet. CSBF is created, for example, by modifying one column vector of W as follows: {tilde over (W)}=[w ₁ . . . w _(k−1) {tilde over (w)} _(k) w _(k+1) . . . w _(K)],

${{where}\mspace{14mu}{\overset{\sim}{w}}_{k}} = {{p_{0}w_{k}} + {\sum\limits_{l = 1}^{N - K}{p_{l}{w_{l}^{c}.}}}}$

One decision is how to choose p_(l). One may start with the K=1 case. The downlink weight matrix can be written as W=UΛV^(H)=λ₁u₁=w₁,

because

$\Lambda = \begin{bmatrix} \lambda_{1} \\ 0 \\ \vdots \\ 0 \end{bmatrix}$ and V=1.

Then, SCBF provides W^(c)=√{square root over (c₀)}[u₂ u₃ . . . u_(N)].

The modified weight vector {tilde over (w)}₁ becomes: {tilde over (w)}₁=[λ₁u₁√{square root over (c₀)}u₂ . . . √{square root over (c₀)}u_(N)]p,

where p=[p₀ p₁ . . . p_(N−1)]^(T). The weight vector {tilde over (w)}₁ can be decomposed by two vectors as {tilde over (w)}₁=(λ₁−√{square root over (c ₀)})u ₁ p ₀+[√{square root over (c ₀)}u ₁√{square root over (c ₀)}u ₂ . . . √{square root over (c ₀)}u _(N) ]p.

If the vector p is chosen as a complex conjugate transpose of l-th row of U, the weight vector can be expressed as {tilde over (w)}₁=(λ₁−√{square root over (c ₀)})u ₁ p ₀+√{square root over (c ₀)}[0 . . . 010 . . . 0]^(T).  (20)

The second vector in (20) has only one non-zero element at l-th antenna. This means the second vector produces omni-directional beam pattern. The beam pattern becomes equation (21) as shown below:

$\begin{matrix} {{z(\theta)} = {{a^{T}{\overset{\sim}{w}}_{1}}}^{2}} \\ {= {{{\frac{\left( {\lambda_{1} - \sqrt{c_{0}}} \right)p_{0}}{\lambda_{1}}}^{2}{{a^{T}w_{1}}}^{2}} + {2\frac{\left( {\lambda_{1} - \sqrt{c_{0}}} \right)\sqrt{c_{0}}}{\lambda_{1}}}}} \\ {{{Re}\left\{ {p_{0}a^{T}w_{1}a_{l}^{*}} \right\}} + c_{0}} \end{matrix}$

The omnibeam pattern caused by the second vector in (20) increases the side lobe of w₁ though there is a ripple because of the cross term in (21). Note when √{square root over (c₀)}=λ₁ the beam becomes omni-directional. Through the scale one can control the side lobe level. Here, one can expect more ripple in the beam compared to the SCBF method. This larger ripple comes from the less degree of freedom in the CSBF.

This argument can be extended to general cases as follows. First choose the k-th beam which has highest side lobe level. Then, change the k-th weight vector to w _(k) =p ₀ w _(k) +W ^(c) p

where p is complex conjugate transpose of the l-th row of W^(c),

$p_{0} = \frac{w_{k,l}^{*}}{w_{k,l}}$ is normalized complex conjugate of the l-th element of w_(k), and W^(c) is given by either the SCBF or SCBF II. Note the increased side lobe beam of the k-th beam still does not interfere with other intended users, resulting in no loss of SIR's of intended users.

With reference to graph 2500 of FIG. 25, when the CSBF technique is applied to the pseudoinverse method the beam patterns are depicted. Here, the sum of beams of users 1-3 is represented by line 2502, the beam of user 4 is represented by line 2504, and the sum of beams of users 1-4 is represented by line 2506. Since the user 4 has the highest side lobe level, the weight vector of user 4 is modified. The SIR improvement over the entire angle is noticeable while making nulls at other user's DOA.

Exemplary beam patterns of the windowed MF with the CSBF are depicted in graph 2600 of FIG. 26. Here, the sum of beams of users 1-3 is represented by line 2602, the beam of user 4 is represented by line 2604, and the sum of beams of users 1-4 is represented by line 2606. Note that the nulls of beam 4 are not as deep because the Hamming windowed MF itself does not generate nulls. However, adopting the null generation technique to the downlink beam, one can create significantly deep nulls.

Graph 2700 in FIG. 27 depicts beam patterns when the SCBF II method is used to generate the CSBF weight matrix. Here, the sum of beams of users 1-3 is represented by line 2702, the beam of user 4 is represented by line 2704, and the sum of beams of users 1-4 is represented by line 2706. One can notice more ripple in the beam of user 4 (line 2704). This higher ripple comes from the less degree of freedom of the SCBF II technique.

Reference is now made to FIG. 36, which is a block diagram illustrating certain features of an exemplary CSBF beamforming transmitter. Here, a plurality (K) of modulators 300 provide d₁(t), d₂(t), . . . , d_(K)(t) modulated signals to a beamforming and vector sum function 309. A downlink beamforming matrix function 302 provides vectors W [w₁, . . . , w_(k), . . . , w_(K)] to beamforming and vector sum function 309, with vector w_(k) being modified at multiplier 308 by p₀ and the results being added via adder 310 to vector W^(c) p 307. In beamforming and vector sum function 309, x₁, . . . , x_(K) digital signals are generated based on:

$x = {\sum\limits_{k = 1}^{K}{w_{k}{{d_{k}(t)}.}}}$

Digital signals x₁, . . . , x_(K) are then each provided to a corresponding digital-to-analog converter (DAC) 306. The resulting analog signals x₁, . . . , x_(K) are then provided to an RF function 256 and corresponding y₁, . . . , y_(K) RF signals are provided to corresponding elements in array antenna 254.

6.2 Complementary Superposition Beamforming II (CSBF II)

If all user's side lobe levels are low enough, one can set up additional channel to send special data to the hidden beam users. This special channel can carry control data only such as CTS, preamble, etc. From the previous subsection, the following weight matrix is devised:

$\overset{\sim}{W} = {\left\lbrack {w_{1}w_{2}\mspace{14mu}\ldots\mspace{14mu} w_{K}{\sum\limits_{l = 1}^{N - K}{p_{l}w_{l}^{c}}}} \right\rbrack.}$

Graph 2800 in FIG. 28 depicts CSBF II beams. Here, the sum of each beam is represented by line 2802, the complementary beam is represented by line 2804, and the z(θ)+z^(c)(θ) is represented by line 2806.

Graph 2900 in FIG. 29 depicts CSBF II beams with Hamming windowed MF (sub I). Here, the sum of each beam is represented by line 2902, the complementary beam is represented by line 2904, and the z(θ)+z^(c)(θ) is represented by line 2906.

Graph 3000 in FIG. 30 depicts CSBF II beams with Hamming windowed MF (sub II). Here, the sum of each beam is represented by line 3002, the complementary beam is represented by line 3004, and the z(θ)+z^(c)(θ) is represented by line 3006.

Reference is now made to FIG. 37, which is a block diagram illustrating certain features of an exemplary CSBF II beamforming transmitter. Here, a plurality (K) of modulators 300 provide d₁(t), d₂(t), . . . , d_(K)(t) modulated signals to a beamforming and vector sum function 313. A modulator 311 provides control data as {tilde over (d)}₁(t) to beamforming and vector sum function 313. A downlink beamforming matrix function 302 provides vectors W=[w₁, . . . , w_(K)] to beamforming and vector sum function 313. From vector W^(c) p 307, {tilde over (w)}₁ is provided to beamforming and vector sum function 313. In beamforming and vector sum function 313, x₁, . . . , x_(K) digital signals are generated based on:

$x = {{\sum\limits_{k = 1}^{K}{w_{k}{d_{k}(t)}}} + {{\overset{\sim}{w}}_{1}{{{\overset{\sim}{d}}_{1}(t)}.}}}$

Digital signals x₁, . . . , x_(K) are then each provided to a corresponding digital-to-analog converter (DAC) 306. The resulting analog signals x₁, . . . , x_(K) are then provided to an RF function 256 and corresponding y₁, . . . , y_(K) RF signals are provided to corresponding elements in array antenna 254.

6.3 Performance of CBF

Through the complementary beamforming techniques, put some energy to the hidden beam directions in order for the hidden beam users to detect or decode data. n this subsection the probability that the hidden beam users can detect or decode data is investigated. The hidden beam problem is usually worst when only one beam is transmitted. When K=1, one can use a MF downlink beam. Thus, CSBF yields:

$W = {{\left( {1 - ɛ} \right)a_{l}\frac{a^{*}(\theta)}{a^{H}a}} + {\left\lbrack {0\mspace{14mu}\ldots\mspace{14mu} 0{ɛ0}\mspace{14mu}\ldots\mspace{14mu} 0} \right\rbrack^{T}.}}$

Note when ε=0, W becomes the MF downlink beam and when ε=1, the beam pattern becomes omni-directional. To see how much improvement can be achieved using the complementary beamformings the following parameters are defined:

(i) SNR_(Req): required SNR for particular data rate

(ii) SNR_(CCA): SNR for hidden users to decide the channel is busy or decode data packets

(iii) Coverage area for the particular data rate: where SNR≧SNR_(Req)

(iv) Prob(SNR≧SNR_(CCA)): the probability that SNR in the coverage area is equal to or greater than SNR_(CCA)

(v) Δ=SNR_(Req)−SNR_(CCA).

In graph 3100 of FIG. 31, the probability is shown on the left vertical axis assuming the users are uniformly distributed over the entire coverage area with path loss exponent equal to 2. On the horizontal axis larger ε values increase the probability. Here, for example, lines 3102, 3104, 3106, 3108, and 3110 show differences (Δs) of 10 db, 7 dB, 5 dB, 3 dB, and 0 dB, respectively. If the total transmitted power should be a certain level, a larger α will reduce the radius of the coverage area as shown by line 3112 and the right hand vertical axis. However, when the difference Δ is larger, a smaller ε will provide the same probability.

As shown in similar graph 3200 in FIG. 32, when the path loss exponent is equal to 4 there is a higher probability. In multiple downlink beams the power penalty will be small. In graph 3200, lines 3202, 3204, 3206, 3208, and 3210 show differences (Δs) of 10 db, 7 dB, 5 dB, 3 dB, and 0 dB, respectively; line 3212 shows the radius of the coverage area.

6.4 Extension to Scattering Environment

6.4.1 Non-zero angular spread and zero delay spread

When multipath components are separated in angles but with approximately the same path delay, the spatial signature of the k-th user can be expressed as:

$h_{k} = {\sum\limits_{l}{h_{k}^{l}{a\left( \theta_{k}^{l} \right)}}}$

where h_(k) ^(l) and θ_(k) ^(l) represent the fading gain and DOA of the l-th multipath, respectively.

The received uplink and downlink signal can be modified as follows: y(t)=Hd(t)+n(t)  (22) and r(t)=H ^(T) Wd(t)+n(t),  (23)

respectively, where H=[h₁ h₂ . . . h_(K)] and the rank of H is assumed K.

The MMSE combining provides optimum uplink combining among the linear combining techniques and the pseudoinverse downlink beamforming yields infinity SIR at intended user's angle.

It is clear that the complementary beamforming techniques can be applied. For the projection, however, one needs to redefine the subspace and consequently the projection matrix also. The subspace S should be the column space of H*. When the downlink beamforming matrix has the special form W=H*B, Theorems 3 and 4 still hold with W=└WH*┘. Using the null generation and the null widening techniques one can create additional nulls at the complementary and downlink beam.

6.4.2 Non-zero angular and delay spread

If multipath arrives at different angles with large delay spread, space-time combining with tapped delay line may be used, for example, as in wideband signal beamformings. See, e.g., Joseph C. Liberti, Jr., and Theodore S. Rappaport, Smart Antennas for Wireless Communications, Prentice Hall, 1999. If the up/downlink signal is an OFDM signal, then the optimum beamforming may, for example, be achieved by space-frequency combining. Since the linear model (22) and (23) hold in the MIMO OFDM signal in frequency domain, one can apply the same rules. 

1. A method, comprising: determining at least one signal operatively configured for subspace complementary beamforming (SCBF) in a wireless communication system; generating the at least one signal such that the signal is operatively configured to cause a smart antenna to perform said SCBF and transmit at least one complementary beam; and determining the at least one signal using a Steering Matrix: A=[a(θ₁) a(θ₂) . . . a(θ_(k))], wherein a(θ_(k)) represents a steering vector of user k; wherein: if W=A*B, where B is a non-singular K-by-K matrix, then using a complementary beamforming matrix of $W^{c} = {\sqrt{\frac{k_{0}C_{0}}{N}}\begin{bmatrix} u_{K + 1} & u_{K + 2} & \ldots & u_{N} \end{bmatrix}}$ wherein C₀=Nc₀ is the level of the main lobe, k₀ is the scaling factor and u_(l) is the l-th column vector of U; otherwise using a complementary beamforming matrix of $W^{c} = {\sqrt{\frac{k_{0}C_{0}}{N}}\begin{bmatrix} {\overset{\_}{u}}_{1} & {\overset{\_}{u}}_{2} & \ldots & {\overset{\_}{u}}_{N - K} \end{bmatrix}}$ wherein ū₁ is the l-th left singular vector of the matrix ${{\left( {\sum\limits_{l = {K + 1}}^{N}{{\overset{\sim}{u}}_{1}{\overset{\sim}{u}}_{1}^{H}}} \right)U\;\Lambda^{c}} = {\overset{\_}{U\;\Lambda}{\overset{\_}{V}}^{H}}},$ where A*=Ũ{tilde over (Λ)}{tilde over (V)}^(H) is assumed and a scattering channel H*=Ũ{tilde over (Λ)}{tilde over (V)}^(H) is assumed.
 2. A method as recited in claim 1, further comprising determining the at least one signal by at least one of: modifying a weight matrix to operatively support said SCBF; expanding a size of the weight matrix to operatively support said SCBF.
 3. A method as recited in claim 1, further comprising determining the at least one signal using a Downlink Beamforming Matrix: W=UΛV^(H).
 4. A method as recited in claim 1, wherein it is assumed that 2K<N, ${W_{a} = {\begin{pmatrix} W & A^{*} \end{pmatrix} = {U_{a}\Lambda_{a}V_{a}^{H}}}},{{{{and}\mspace{14mu} W^{c}} = {\sqrt{\frac{k_{0}C_{0}}{N}}\begin{bmatrix} u_{a,{r + 1}} & u_{a,{r + 2}} & \ldots & u_{a,N} \end{bmatrix}}};{and}}$ wherein r is rank of W_(a).
 5. A method, comprising: determining at least one signal operatively configured for complementary superposition beamforming (CSBF) in a wireless communication system; generating the at least one signal such that the signal is operatively configured to cause a smart antenna to perform said CSBF and to transmit at least one complementary beam, and determining the at least one signal using a downlink beamforming matrix: {tilde over (W)}=└w₁ . . . w_(k−1) {tilde over (w)}_(k) w_(k+1) . . . w_(k)┘, where {tilde over (w)}_(k)=p₀w_(k)+W^(c)p and p is complex conjugate transpose of the l-th row of W^(c), $p_{0} = \frac{w_{k,l}^{*}}{w_{k,l}}$ is normalized complex conjugate of the l-th element of w_(k), where W^(c)=√{square root over (c₀[u_(K+1), u_(K+2), . . . u_(N)])}, C₀ is a scalar, K=the number of users, N=the number of antennas and u_(l) is the l-th vector of U.
 6. A method as recited in claim 5, further comprising determining the at least one signal using a null-generation technique that is configured to generate L nulls at angles θ₁, θ₂, . . . θ_(L) at a beam.
 7. A method as recited in claim 5, further comprising determining said at least one signal using: A=[a(θ₁) a(θ₂) . . . a(θ_(L))].
 8. A method as recited in claim 5, further comprising determining the at least one signal using a vector: w=(I−P_(s))w where P_(s)=A*(A^(T) A*)⁻¹ A^(T), and in scattering channel P_(s)=H*(H^(T) A*)⁻¹ H^(T).
 9. A method as recited in claim 5, further comprising determining the at least one signal using a null-widening technique that is configured to produce at least one null at a vicinity of selected angles.
 10. A method as recited in claim 5, further comprising determining the at least one signal by selectively modifying a steering matrix to: A=└ã(θ₁){tilde over (a)}(θ₂) . . . ã(θ_(K))┘, wherein {tilde over (a)}(θ_(K))=└a(θ_(k)−Δθ₁)a(θ_(k))a(θ_(k)+Δθ_(r))┘.
 11. A method as recited in claim 5, further comprising determining the at least one signal by establishing at least two nulls such that a rank of A is less than N.
 12. A method as recited in claim 5, further comprising determining the at least one signal using adaptive control of a complementary beam level.
 13. A method as recited in claim 5, further comprising determining the at least one signal, in a non-zero angular channel, by selectively reducing a complementary beam level.
 14. A method as recited in claim 5, further comprising determining the at least one signal, for delay spread channels, by selectively reducing a complementary beam level.
 15. A method as recited in claim 5, further comprising determining the at least one signal, in free space, by selectively increasing the complementary beam level.
 16. A method, comprising: determining at least one signal operatively configured for complementary superposition beamforming (CSBF) in a wireless communication system; generating the at least one signal such that the signal is operatively configured to cause a smart antenna to perform said CSBF and to transmit at least one complementary beam, and determining the at least one signal using: {tilde over (W)}=[w₁ w₂ . . . w_(k) W^(c)p] wherein: p is complex conjugate transpose of the l-th row of W^(c), W ^(c)=√{square root over (c ₀ [u _(K+1) , u _(K+2) , . . . , u _(N)])}, c₀ is a scalar, K=the number of users, N=the number of antennas and u_(l) is the l-th column vector of U.
 17. A method as recited in claim 16, further comprising determining the at least one signal using a null-generation technique that is configured to generate L nulls at angles θ₁, θ₂, . . . θ_(L) at a beam.
 18. A method as recited in claim 16, further comprising determining said at least one signal using: A=[a(θ₁) a(θ₂) . . . a(θ_(L))].
 19. A method as recited in claim 16, further comprising determining the at least one signal using a vector: w=(I−P_(s))w where P_(s)=A*(A^(T) A*)⁻¹ A^(T), and in scattering channel P_(s)=H*(H^(T) A*)⁻¹H^(T).
 20. A method as recited in claim 16, further comprising determining the at least one signal using a null-widening technique that is configured to produce at least one null at a vicinity of selected angles.
 21. A method as recited in claim 16, further comprising determining the at least one signal by selectively modifying a steering matrix to: A=└ã(θ₁)ã(θ₂) . . . {tilde over (a)}(θ_(K))┘, wherein ã(θ_(K))=└a(θ_(k)−Δθ₁)a(θ_(k))a(θ_(k)+Δθ_(r))┘.
 22. A method as recited in claim 16, further comprising determining the at least one signal by establishing at least two nulls such that a rank of A is less than N.
 23. A method as recited in claim 16, further comprising determining the at least one signal using adaptive control of a complementary beam level.
 24. A method as recited in claim 16, further comprising determining the at least one signal, in a non-zero angular channel, by selectively reducing a complementary beam level.
 25. A method as recited in claim 16, further comprising determining the at least one signal, for delay spread channels, by selectively reducing a complementary beam level.
 26. A method as recited in claim 16, further comprising determining the at least one signal, in free space, by selectively increasing the complementary beam level.
 27. A method, comprising: determining at least one signal operatively configured for complementary superposition beamforming (CSBF) in a wireless communication system; generating the at least one signal such that the signal is operatively configured to cause a smart antenna to perform said CSBF and to transmit at least one complementary beam, and determining the at least one signal using a downlink beamforming matrix: {tilde over (W)}=└w₁ . . . w_(k−1) {tilde over (w)}_(k) w_(k+1) . . . w_(k)┘, where {tilde over (w)}_(k)=p₀w_(k)+W^(c)p and p is complex conjugate transpose of the l-th row of W^(c), $p_{0} = \frac{w_{k,l}^{*}}{w_{k,l}}$ is normalized complex conjugate of the l-th element of w_(k), where W^(c)=√{square root over (c₀[u_(a,r+1), u_(a,r+2), . . . , u_(a,N)])}, c₀ is a scalar, K=the number of users, N=the number of antennas, r=rank of W and is in the range of K to 2K and u_(a,l) is the l-th left singular vector whose corresponding singular value is zero.
 28. A method as recited in claim 27, further comprising determining the at least one signal using a null-generation technique that is configured to generate L nulls at angles θ₁, θ₂, . . . θ_(L) at a beam.
 29. A method as recited in claim 27, further comprising determining said at least one signal using: A=[a(θ₁) a(θ₂) . . . a(θ_(L))].
 30. A method as recited in claim 27, further comprising determining the at least one signal using a vector: w=(I−P_(s))w where P_(s)=A*(A^(T) A*)⁻¹ A^(T), and in scattering channel P_(s)=H*(H^(T) A*)⁻¹H^(T).
 31. A method as recited in claim 27, further comprising determining the at least one signal using a null-widening technique that is configured to produce at least one null at a vicinity of selected angles.
 32. A method as recited in claim 27, further comprising determining the at least one signal by selectively modifying a steering matrix to: A=└ã(θ₁)ã(θ₂) . . . ã(θ_(K))┘, wherein {tilde over (a)}(θ_(K))=└a(θ_(k)−Δθ₁)a(θ_(k))a(θ_(k)+Δθ_(r))┘.
 33. A method as recited in claim 27, further comprising determining the at least one signal by establishing at least two nulls such that a rank of A is less than N.
 34. A method as recited in claim 27, further comprising determining the at least one signal using adaptive control of a complementary beam level.
 35. A method as recited in claim 27, further comprising determining the at least one signal, in a non-zero angular channel, by selectively reducing a complementary beam level.
 36. A method as recited in claim 27, further comprising determining the at least one signal, for delay spread channels, by selectively reducing a complementary beam level.
 37. A method as recited in claim 27, further comprising determining the at least one signal, in free space, by selectively increasing the complementary beam level.
 38. A method, comprising: determining at least one signal operatively configured for complementary superposition beamforming (CSBF) in a wireless communication system; generating the at least one signal such that the signal is operatively configured to cause a smart antenna to perform said CSBF and to transmit at least one complementary beam, and determining the at least one signal using: {tilde over (W)}=[w₁ w₂ . . . w_(k) W^(c)p] wherein: p is complex conjugate transpose of the l-th row of W^(c), W ^(c)=√{square root over (c ₀ [u _(a,r+1) , e _(a,r+2) , . . . , u _(a,N)])}, c₀ is a scalar, K=the number of users, N=the number of antennas, r=rank of W and is in the range of K to 2K and u_(a,l) is the l-th left singular vector whose corresponding singular value is zero.
 39. A method as recited in claim 38, further comprising determining the at least one signal using a null-generation technique that is configured to generate L nulls at angles θ₁, θ₂, . . . θ_(L) at a beam.
 40. A method as recited in claim 38, further comprising determining said at least one signal using: A=[a(θ₁) a(θ₂) . . . a(θ_(L))].
 41. A method as recited in claim 38, further comprising determining the at least one signal using a vector: w=(I−P_(s))w where P_(s)=A*(A^(T) A*)⁻¹ A^(T), and in scattering channel P_(s)=H*(H^(T) A*)⁻¹ H^(T).
 42. A method as recited in claim 38, further comprising determining the at least one signal using a null-widening technique that is configured to produce at least one null at a vicinity of selected angles.
 43. A method as recited in claim 38, further comprising determining the at least one signal by selectively modifying a steering matrix to: A=└ã(θ₁)ã(θ₂) . . . {tilde over (a)}(θ_(K))┘, wherein ã(θ_(K))=└a(θ_(k)−Δθ₁)a(θ_(k))a(θ_(k)+Δθ_(r))┘.
 44. A method as recited in claim 38, further comprising determining the at least one signal by establishing at least two nulls such that a rank of A is less than N.
 45. A method as recited in claim 38, further comprising determining the at least one signal using adaptive control of a complementary beam level.
 46. A method as recited in claim 38, further comprising determining the at least one signal, in a non-zero angular channel, by selectively reducing a complementary beam level.
 47. A method as recited in claim 38, further comprising determining the at least one signal, for delay spread channels, by selectively reducing a complementary beam level.
 48. A method as recited in claim 38, further comprising determining the at least one signal, in free space, by selectively increasing the complementary beam level. 